Map Edit Distance vs. Graph Edit Distance for Matching Images
نویسندگان
چکیده
Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another map. In this paper, we introduce labelled maps and we show how the map edit distance may be extended to compare labeled maps. We experimentally compare our map edit distance to the graph edit distance for matching regions of different segmentations of a same image.
منابع مشابه
Bayesian Graph Edit Distance
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability distribution for structural errors in the graph-matching problem. This probability distribution is used to locate mat...
متن کاملDetermining Image Similarity from Pattern Matching of Abstract Syntax Trees of Tree Picture Grammars
This paper studies the use of tree edit distance for pattern matching of abstract syntax trees of images generated with tree picture grammars. This was done with a view to measuring its effectiveness in determining image similarity, when compared to current state of the art similarity measures used in Content Based Image Retrieval (CBIR). Eight computer based similarity measures were selected f...
متن کاملGraph Edit Distance for Active Graph Matching in Content Based Retrieval Applications
Application of multimedia technologies to visual data, like still images and videos, is receiving an increasing attention especially for the large number of potential innovative solutions which are expected to emerge in the next years. In this context, techniques for retrieval by visual similarity are expected to boost the interest of users through the definition of novel paradigms to access di...
متن کاملEdit Distance From Graph Spectra
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the formality and rigour of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that standard string edit distance techniques can be used. To do this we use graph spectral seri...
متن کاملApproximate graph edit distance computation by means of bipartite graph matching
In recent years, the use of graph based object representation has gained popularity. Simultaneously, graph edit distance emerged as a powerful and flexible graph matching paradigm that can be used to address different tasks in pattern recognition, machine learning, and data mining. The key advantages of graph edit distance are its high degree of flexibility, which makes it applicable to any typ...
متن کامل